An Active Set Newton Method for Mathematical Programs with Complementarity

نویسندگان

  • A. F. Izmailov
  • M. V. Solodov
چکیده

For mathematical programs with complementarity constraints (MPCC), we propose an active set Newton method which has the property of local quadratic convergence under the MPCC linear independence constraint qualification (MPCC-LICQ) and the standard second-order sufficient condition for optimality (SOSC). Under MPCC-LICQ, this SOSC is equivalent to the piecewise SOSC on branches of MPCC, which is weaker than the special MPCC-SOSC often employed in the literature. The piecewise SOSC is also more natural than MPCCSOSC because, unlike the latter, it has an appropriate second-order necessary condition as its counterpart. In particular, our assumptions for local quadratic convergence are weaker than those required by standard SQP when applied to MPCC, and are equivalent to assumptions required by piecewise SQP for MPCC. Moreover, each iteration of our method consists of solving a linear system of equations instead of a quadratic program. Some globalization issues of the local scheme are also discussed, and illustrative examples are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Active Set Method for Mathematical Programs with Linear Complementarity Constraints

We study mathematical programs with linear complementarity constraints (MPLCC) for which the objective function is smooth. Current nonlinear programming (NLP) based algorithms including regularization methods and decomposition methods generate only weak (e.g., Cor M-) stationary points that may not be first-order solutions to the MPLCC. Piecewise sequential quadratic programming methods enjoy s...

متن کامل

An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints

For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC linear independence constraint qualification (MPCC-LICQ) and the standard second-order sufficient condition (SOSC) for optimality. Under MPCC-LICQ, this SOSC is equivalent to the piecewise SOSC on branches of MPCC, which...

متن کامل

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

A Class of Quadratic Programs with Linear Complementarity Constraints

We consider a class of quadratic programs with linear complementarity constraints (QPLCC) which belong to mathematical programs with equilibrium constraints (MPEC). We investigate various stationary conditions and present new and strong necessary and sufficient conditions for global and local optimality. Furthermore, we propose a Newton-like method to find an M-stationary point in finite steps ...

متن کامل

A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem

In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006